Towards a Unified Taxonomy of Biclustering Methods

نویسندگان

  • Dmitry I. Ignatov
  • Bruce W. Watson
چکیده

Being an unsupervised machine learning and data mining technique, biclustering and its multimodal extensions are becoming popular tools for analysing object-attribute data in different domains. Apart from conventional clustering techniques, biclustering is searching for homogeneous groups of objects while keeping their common description, e.g., in binary setting, their shared attributes. In bioinformatics, biclustering is used to find genes, which are active in a subset of situations, thus being candidates for biomarkers. However, the authors of those biclustering techniques that are popular in gene expression analysis, may overlook the existing methods. For instance, BiMax algorithm is aimed at finding biclusters, which are well-known for decades as formal concepts. Moreover, even if bioinformatics classify the biclustering methods according to reasonable domain-driven criteria, their classification taxonomies may be different from survey to survey and not full as well. So, in this paper we propose to use concept lattices as a tool for taxonomy building (in the biclustering domain) and attribute exploration as means for cross-domain taxonomy completion.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards a unified taxonomy and architecture of cloud frameworks

Infrastructure as a Service (IaaS) is one of the most important layers of Cloud Computing. However, there is an evident deficiency of mechanisms for analysis, comparison and evaluation of IaaS cloud implementations, since no unified taxonomy or reference architecture is available. In this article, we propose a unified taxonomy and an IaaS architectural framework. The taxonomy is structured arou...

متن کامل

Optimal Estimation and Completion of Matrices with Biclustering Structures

Biclustering structures in data matrices were first formalized in a seminal paper by John Hartigan [15] where one seeks to cluster cases and variables simultaneously. Such structures are also prevalent in block modeling of networks. In this paper, we develop a theory for the estimation and completion of matrices with biclustering structures, where the data is a partially observed and noise cont...

متن کامل

A biclustering approach based on factor graphs and the max-sum algorithm

Biclustering represents an intrinsically complex problem, where the aim is to perform a simultaneous rowand column-clustering of a given data matrix. Some recent approaches model this problem using factor graphs, so to exploit their ability to open the door to efficient optimization approaches for well designed function decompositions. However, while such models provide promising results, they ...

متن کامل

Towards A Unified Framework For Geographical Data Models

This paper describes a unified framework for the problems of modelling and processing geographical entities. We propose a general definition of geographical objects, and show that the different types of geographical data can be expressed as particular cases of this definition. Furthermore, we present a taxonomy for the various types of GIS operations, defined in terms of the properties of this ...

متن کامل

Towards a unified framework for spatial data models

This paper describes a unified framework for the problems of modelling and processing spatial entities. We propose a general definition of spatial objects, and show that the different types of spatial data can be expressed as particular cases of this definition. Furthermore, we present a taxonomy for the various types of GIS operations, defined in terms of the properties of this definition. Our...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1702.05376  شماره 

صفحات  -

تاریخ انتشار 2016